An approximate EM Homographical Iterative Closest Point algorithm

نویسندگان

  • Markus Louw
  • Fred Nicolls
چکیده

This paper describes an approximately expectationmaximization (EM) formulation of a homographical iterative closest point registration approach (henceforth HICP). We show that such an EM approach allows the algorithm to converge faster, and more robustly in the presence of noise. Although this algorithm can register points transformed by a more general set of linear transformations than the original Iterative Closest Point (ICP) algorithm, it is only appropriate for use on point sets which are related by a homographical transformation, e.g. images taken of a planar scene from different angles, or images taken of a general scene by a stationary pan-tilt-zoom camera. The algorithm is tested on real and synthetic data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rigid Point-Surface Registration Using an EM Variant of ICP for Computer Guided Oral Implantology

We investigate the rigid registration of a set of points onto a surface for computer-guided oral implants surgery. We first formulate the Iterative Closest Point (ICP) algorithm as a Maximum Likelihood (ML) estimation of the transformation and the matches. Then, considering matches as a hidden random variable, we show that the ML estimation of the transformation alone leads to a criterion effic...

متن کامل

Point-Based Statistical Shape Models with Probabilistic Correspondences and Affine EM-ICP

A fundamental problem when computing statistical shape models (SSMs) is the determination of correspondences between the instances. Often, homologies between points that represent the surfaces are assumed which might lead to imprecise mean shape and variation results. We present a novel algorithm based on the affine Expectation Maximization Iterative Closest Point (EM-ICP) registration method. ...

متن کامل

Approximate K-D Tree Search for Efficient ICP

A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k-d tree. The standard k-d tree uses a tentative backtracking search to identify nearest neighbors. In contrast, the Approximate k-d tree (Ak-d tree) applies a depthfirst nontentative search to the k-d tree structure. T...

متن کامل

A Correlation-Based Approach to Robust Point Set Registration

Correlation is a very effective way to align intensity images. We extend the correlation technique to point set registration using a method we call kernel correlation. Kernel correlation is an affinity measure, and it is also a function of the point set entropy. We define the point set registration problem as finding the maximum kernel correlation configuration of the the two point sets to be r...

متن کامل

An Iterative Closest Points Algorithm for Registration of 3D Laser Scanner Point Clouds with Geometric Features

The Iterative Closest Points (ICP) algorithm is the mainstream algorithm used in the process of accurate registration of 3D point cloud data. The algorithm requires a proper initial value and the approximate registration of two point clouds to prevent the algorithm from falling into local extremes, but in the actual point cloud matching process, it is difficult to ensure compliance with this re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005